Inference for best linear approximations to set identified functions

نویسندگان

  • Arun Chandrasekhar
  • Victor Chernozhukov
  • Francesca Molinari
  • Paul Schrimpf
  • ARUN CHANDRASEKHAR
  • VICTOR CHERNOZHUKOV
  • FRANCESCA MOLINARI
چکیده

This paper provides inference methods for best linear approximations to functions which are known to lie within a band. It extends the partial identification literature by allowing the upper and lower functions defining the band to be any functions, including ones carrying an index, which can be estimated parametrically or non-parametrically. The identification region of the parameters of the best linear approximation is characterized via its support function, and limit theory is developed for the latter. We prove that the support function approximately converges to a Gaussian process, and validity of the Bayesian bootstrap is established. The paper nests as special cases the canonical examples in the literature: mean regression with interval valued outcome data and interval valued regressor data. Because the bounds may carry an index, the paper covers problems beyond mean regression; the framework is extremely versatile. Applications include quantile and distribution regression with interval valued data, sample selection problems, as well as mean, quantile, and distribution treatment effects. Moreover, the framework can account for the availability of instruments. An application is carried out, studying female labor force participation along the lines of Mulligan and Rubinstein (2008). JEL Classification Codes: C13, C31. AMS Classification Codes: 62G08, 62G09, 62P20. First draft presented on Dec. 4, 2008. This version: October 30, 2012

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

t-BEST APPROXIMATION IN FUZZY NORMED SPACES

The main purpose of this paper is to find t-best approximations in fuzzy normed spaces. We introduce the notions of t-proximinal sets and F-approximations and prove some interesting theorems. In particular, we investigate the set of all t-best approximations to an element from a set.

متن کامل

Nonlinear Finite Element Analysis of Bending of Straight Beams Using hp-Spectral Approximations

Displacement finite element models of various beam theories have been developed using traditional finite element interpolations (i.e., Hermite cubic or equi-spaced Lagrange functions). Various finite element models of beams differ from each other in the choice of the interpolation functions used for the transverse deflection w, total rotation φ and/or shear strain γxz, or in the integral form u...

متن کامل

ADAPTIVE NEURO-FUZZY INFERENCE SYSTEM OPTIMIZATION USING PSO FOR PREDICTING SEDIMENT TRANSPORT IN SEWERS

The flow in sewers is a complete three phase flow (air, water and sediment). The mechanism of sediment transport in sewers is very important. In other words, the passing flow must able to wash deposited sediments and the design should be done in an economic and optimized way. In this study, the sediment transport process in sewers is simulated using a hybrid model. In other words, using the Ada...

متن کامل

Piecewise Linear Approximations of Nonlinear Deterministic Conditionals in Continuous Bayesian Networks

To enable inference in continuous Bayesian networks containing nonlinear deterministic conditional distributions, Cobb and Shenoy (2005) have proposed approximating nonlinear deterministic functions by piecewise linear ones. In this paper, we describe two principles and a heuristic for finding piecewise linear approximations of nonlinear functions. We illustrate our approach for some commonly u...

متن کامل

Learning Search Based Inference for Object Detection

We study the problem of visual object detection and propose a method that learns the inference procedure during training time. We propose a best-first search based inference system that is already optimized for during training. This overcomes the inherent limitation of branch&bound whose applicability relies on the availability of tight bounding functions. The optimization problem is implemente...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012